Real number computation through Gray code embedding

نویسنده

  • Hideki Tsuiki
چکیده

منابع مشابه

Logic for Gray Code Computation

Gray code is a well-known binary number system such that neighboring values differ in one digit only. Tsuiki (2002) has introduced Gray code to the field of real number computation. He assigns to each number a unique 1⊥-sequence, i.e., a (possibly infinite) sequence of {−1, 1,⊥} such that at most one copy of ⊥ (meaning undefinedness) is contained in the sequence not as the last character. In th...

متن کامل

Lightweight Component Models for Embedded Systems

Components are receiving attention as a means of advancing the state of software distribution beyond the traditional choices of source code, compiled binary executable, and compiled libraries. In this paper, we examine lightweight component models for embedded real-time software systems, and propose two different component models based on the concepts of actors and models of computation.

متن کامل

Spatial Image Watermarking by Error-Correction Coding in Gray Codes

In this paper, error-correction coding (ECC) in Gray codes is considered and its performance in the protecting of spatial image watermarks against lossy data compression is demonstrated. For this purpose, the differences between bit patterns of two Gray codewords are analyzed in detail. On the basis of the properties, a method for encoding watermark bits in the Gray codewords that represent sig...

متن کامل

Steganography Scheme Based on Reed-Muller Code with Improving Payload and Ability to Retrieval of Destroyed Data for Digital Images

In this paper, a new steganography scheme with high embedding payload and good visual quality is presented. Before embedding process, secret information is encoded as block using Reed-Muller error correction code. After data encoding and embedding into the low-order bits of host image, modulus function is used to increase visual quality of stego image. Since the proposed method is able to embed...

متن کامل

Properties of Gray and Binary Representations

Representations are formalized as encodings that map the search space to the vertex set of a graph. We define the notion of bit equivalent encodings and show that for such encodings the corresponding Walsh coefficients are also conserved. We focus on Gray codes as particular types of encoding and present a review of properties related to the use of Gray codes. Gray codes are widely used in conj...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 284  شماره 

صفحات  -

تاریخ انتشار 2002